min-max theory

См. также в других словарях:

• Min-Max-Theorem — Das Min Max Theorem ist ein grundlegendes Lösungskonzept in der Spieltheorie und wird mitunter als Hauptsatz für 2 Personen Nullsummenspiele bezeichnet.[1] Die Minimierung der gegnerischen Maximal Auszahlung beider Spieler steht im Vordergrund… …   Deutsch Wikipedia

• max|i|min — «MAK suh mihn», noun. that strategy in the theory of games which provides the maximum of a player s minimum possible gains (contrasted with minimax): »Maximin is like a philosophy of complete pessimism except that the decision is based on the… …   Useful english dictionary

• min|i|max — «MIHN ee maks», noun, adjective, verb. –n. 1. that strategy in the theory of games which provides the minimum of a player s maximum possible losses (contrasted with maximin). 2. = minimax theorem. (Cf. ↑minimax theorem) –adj. of or having to do… …   Useful english dictionary

• Max-flow min-cut theorem — In optimization theory, the max flow min cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink is equal to the minimum capacity which when removed in a specific way from the network causes the… …   Wikipedia

• Max-Plus-Algebra — Eine Max Plus Agebra ist ein mathematisches Objekt, das vergleichbar ist mit einer Algebra über den reellen Zahlen, wobei jedoch die Körper Operationen ersetzt werden: die Addition durch das Bilden des Maximums, die Multiplikation durch die… …   Deutsch Wikipedia

• Max-Flow-Min-Cut-Theorem — Das Max Flow Min Cut Theorem ist ein Satz der Graphentheorie über den maximalen Fluss in Flussnetzwerken. Er leitet sich aus Mengers Theorem ab. Er besagt: Der maximale Fluss im Netzwerk hat genau den Wert dessen minimalen Schnitts. Anders gesagt …   Deutsch Wikipedia

• Info-gap decision theory — is a non probabilistic decision theory that seeks to optimize robustness to failure – or opportuneness for windfall – under severe uncertainty,[1][2] in particular applying sensitivity analysis of the stability radius type[3] to perturbations in… …   Wikipedia

• Possibility theory — is a mathematical theory for dealing with certain types of uncertainty and is an alternative to probability theory. Professor Lotfi Zadeh first introduced possibility theory in 1978 as an extension of his theory of fuzzy sets and fuzzy logic. D.… …   Wikipedia

• König's theorem (graph theory) — In the mathematical area of graph theory, König s theorem describes an equivalence between the maximum matching problem and the minimum vertex cover problem in bipartite graphs. Setting A graph is bipartite if its vertices can be partitioned into …   Wikipedia

• Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… …   Wikipedia

• Haven (graph theory) — In graph theory, if G is a graph, and k ge 0 is an integer, a haven of order k in G is a function assigning to every set X subseteq V(G) with ig|Xig| < k a vertex set of a component of G igackslash X, etaig(Xig), such that if X subseteq Y… …   Wikipedia